Chromaticity of Complete 6-Partite Graphs with Certain Star or Matching Deleted
نویسندگان
چکیده
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6n vertices according to the number of 7-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, many new families of chromatically unique complete 6-partite graphs with certain star or matching deleted are obtained. 2010 Mathematics Subject Classification: 05C15
منابع مشابه
Chromaticity of Complete Tripartite Graphs With Certain Star or Matching Deleted
Let P (G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G, λ) = P (H, λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6n vertices according to the number of 7-independent partitions of G. Using these re...
متن کاملOn Chromatic Uniqueness of Complete Complete 6-Partite Graphs
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs G with 6n + i vertices for i = 0, 1, 2 according to the number of 7-independent partitions o...
متن کاملOn Chromatic Uniqueness of Certain 6-Partite Graphs
Let P (G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H, if P (G,λ) = P (H,λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6n + 2 vertices according to the number of 7-independent partitions of G. Using these r...
متن کاملChromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملUnmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کامل